An evaluation of location management procedures

This paper gives a comparative description of two scenarios for location management in a mobile telecommunications system. The first scenario uses fixed location and paging areas. Mobiles perform a location update as they enter a new location area. The second scenario uses a time-out based location updating scheme. Mobiles start their timer as they leave the paging area they are currently registered in. As the timer elapses, the mobile performs a location update. Both scenarios also differ in the way paging is performed. In the first scenario it is only necessary to page in the location area the mobile is currently registered in. In order to do this efficiently, the paging is done in a 2-step fashion: mobiles are paged first in the paging area in which they were registered in, and next in the entire location area they are registered in. In the second scenario the mobile is paged in multiple steps: first in the paging area it is registered in, next in a circle of paging areas surrounding that area, and so on, until the mobile is found, or the number of steps has reached a certain upper limit. Results comprise a quantitative and qualitative comparison of these scenarios, and guidelines for optimal applicatio

Long-range Angular Correlations On The Near And Away Side In P-pb Collisions At √snn=5.02 Tev

7191/Mar294

Elliptic flow of identified hadrons in Pb-Pb collisions at 1asNN = 2.76 TeV

The elliptic flow coefficient (v2) of identified particles in Pb-Pb collisions at 1asNN = 2.76 TeV was measured with the ALICE detector at the Large Hadron Collider (LHC). The results were obtained with the Scalar Product method, a two-particle corre- lation technique, using a pseudo-rapidity gap of | 06\u3b7| > 0.9 between the identified hadron under study and the reference particles. The v2 is reported for \u3c0\ub1, K\ub1, K0S, p+p, \u3c6, \u39b+\u39b, \u39e 12+\u39e+ and \u3a9 12+\u3a9+ in several collision centralities. In the low transverse momentum (pT) region, pT 3 GeV/c

Evacuating robots via unknown exit in a disk

Consider k mobile robots inside a circular disk of unit radius. The robots are required to evacuate the disk through an unknown exit point situated on its boundary. We assume all robots having the same (unit) maximal speed and starting at the centre of the disk. The robots may communicate in order to inform themselves about the presence (and its position) or the absence of an exit. The goal is for all the robots to evacuate through the exit in minimum time.We consider two models of communication between the robots: in non-wireless (or local) communication model robots exchange information only when simultaneously located at the same point, and wireless commun